269
Views
11
CrossRef citations to date
0
Altmetric
Articles

A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery

, &
Pages 65-75 | Received 08 May 2013, Accepted 19 Jan 2014, Published online: 19 Mar 2014

References

  • Ai, T. J. and V. Kachitvichyanukul, “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery,” Computers & Operations Research, 36, 1693–1702 (2009).
  • Bodin, L., B. Golden, A. Assad and M. Ball, “Routing and scheduling of vehicles and crews: The state of the art,” Computers and Operations Research, 10, 63–212 (1986).
  • Chen, J. F. and T. H. Wu, “Vehicle routing problem with simultaneous deliveries and pickups,” Journal of the Operational Research Society, 57, 579–587 (2006).
  • Croes, G., “A method for solving traveling-salesman problems,” Operations Research, 6, 791–812 (1958).
  • Dell’Amico, M., G. Righini and M. Salani, “A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection,” Transportation Science, 40, 235–247(2006).
  • Dethloff, J., “Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up,” OR Spectrum, 23, 79–96 (2001).
  • Dorigo, M., Optimization, Learning and Natural Algorithms, PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, (1992).
  • Emmanouil, E. Z., D. T. Christos and T. K. Chris, “A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service,” Expert Systems with Applications, 36, 1070–1081 (2009).
  • Dorigo, M., V. Maniezzo and A. Colorni, “The ant system: Optimization by a colony of cooperating agents.” IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 29–41 (1996).
  • Glover, F., “Future paths for integer programming and links to artificial intelligence,” Computers and Operations Research, 13, 533–549 (1986).
  • Min, H., “The multiple vehicle routing problem with simultaneous delivery and pick-up points,” Transportation Research Part A: General, 23, 377–386 (1989).
  • Montané, F. A. T. and R. D. Galvão, “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service,” Computers & Operations Research, 33, 595–619 (2006).
  • Ropke, S. and D. Pisinger, “A unified heuristic for a large class of vehicle routing problems with backhauls,” European Journal of Operational Research, 171, 750–775 (2006).
  • Saadati Eskandari, Z. and M. Yousefikhoshbakht, “Solving the vehicle routing problem by an effective reactive bone route algorithm,” Transportation Research Journal, 2, 51–67 (2012).
  • Salhi, S. and G. Nagy, “A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling,” Journal of the Operational Research Society, 50, 1034–1042 (1999).
  • Subramanian, A., A. F. CabralL and L. S. Ochi, An efficient ILS heuristic for the vehicle routing problem with simultaneous pickup and delivery, Universidade Federal Fluminense, Technical Report (2008).
  • Subramanian, A., E. Uchoa, A. A. Pessoa and L. S. Ochi, “Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery,” Optimization Letters, 7, 1569–1581 (2013).
  • Subramanian, A. L., M. A. Drummonda, C. Bentes, L. S. Ochi and R. Farias, “A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery,” Computers & Operations Research, 37, 1899–1911 (2010).
  • Tang, F. A. and R. D. Galvao, “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service,” Computers and Operations Research, 33, 595–619 (2006).
  • Tarantilis, C. D. and C. T. Kiranoudis, “A meta-heuristic algorithm for the efficient distribution of perishable foods,” Journal of Food Engineering, 50, 1–9 (2001).
  • Tarantilis, C. D., E. Zachariadis and C. Kiranoudis, “A guided tabu search for the heterogeneous vehicle routing problem,” Journal of the Operational Research Society, 59, 1659–1673 (2008).
  • Tasan, A. S. and M. Gen, “Genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries,” Computers & Industrial Engineering, 62, 755–761 (2012).
  • Wassan, N. A., A. H. Wassan and G. Nagy, “A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries,” Journal of Combinatorial Optimization, 15, 368–386 (2008).
  • Yousefikhoshbakhtm, M. and E. Khorram, “Solving the vehicle routing problem by a hybrid meta-heuristic algorithm,” Journal of Industrial Engineering International, 8, 1–9 (2012).
  • Yousefikhoshbakht, M., F. Didehvar and F. Rahmati, “Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm,” International Journal of Production Research, 1–11 ( accepted in 2013). doi:10.1080/00207543.2013.855337
  • Yousefikhoshbakht, M. and M. Sedighpour, “A combination of sweep algorithm and elite ant colony optimization for solving the multiple traveling salesman problem,” Proceedings of the Romanian Academy A, 13, 295–302 (2012).
  • Yousefikhoshbakht, M. and M. Sedighpour, “A new imperialist competitive algorithm to solve the traveling salesman problem,” International Journal of Computer Mathematics, 90, 1495–1505 (2013).
  • Zachariadis, E. E., C. D. Tarantilis and C. T. Kiranoudis, “A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service,” Expert Systems with Applications, 36, 1070–1081 (2009).
  • Zhang, T., W. A. Chaovalitwongse and Y. Zhang, “Scatter search for the stochastic travel time vehicle routing problem with simultaneous pickups and deliveries,” Computers & Operations Research, 39, 2277–2290 (2011).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.