Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2008, Article ID 697981, 17 pages
http://dx.doi.org/10.1155/2008/697981
Research Article

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Faculty of Electrical Engineering, Josip Juraj Strossmayer University of Osijek, Kneza Trpimira 2b, 31000 Osijek, Croatia

Received 24 May 2008; Revised 6 October 2008; Accepted 19 December 2008

Academic Editor: Alois Steindl

Copyright © 2008 Goran Martinovic et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Hernández-Pérez and J.-J. Salazar-González, “A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery,” Discrete Applied Mathematics, vol. 145, no. 1, pp. 126–139, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. G. M. Giaglis, I. Minis, A. Tatarakis, and V. Zeimpekis, “Minimizing logistics risk through real-time vehicle routing and mobile technologies: research to date and future trends,” International Journal of Physical Distribution & Logistics Management, vol. 34, no. 9, pp. 749–764, 2004. View at Publisher · View at Google Scholar
  3. B. L. Hollis, M. A. Forbes, and B. E. Douglas, “Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post,” European Journal of Operational Research, vol. 173, no. 1, pp. 133–150, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. G. Jeon, H. R. Leep, and J. Y. Shim, “A vehicle routing problem solved by using a hybrid genetic algorithm,” Computers & Industrial Engineering, vol. 53, no. 4, pp. 680–692, 2007. View at Publisher · View at Google Scholar
  5. G. Mosheiov, “Vehicle routing with pick-up and delivery: tour-partitioning heuristics,” Computers & Industrial Engineering, vol. 34, no. 3, pp. 669–684, 1998. View at Publisher · View at Google Scholar
  6. J. Brandão, “A new tabu search algorithm for the vehicle routing problem with backhauls,” European Journal of Operational Research, vol. 173, no. 2, pp. 540–555, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. H. Min, “The multiple vehicle routing problem with simultaneous delivery and pick-up points,” Transportation Research Part A, vol. 23, no. 5, pp. 377–386, 1989. View at Publisher · View at Google Scholar
  8. F. A. Tang Montané and R. D. Galvão, “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service,” Computers & Operations Research, vol. 33, no. 3, pp. 595–619, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. A. G. H. Kek, R. L. Cheu, and Q. Meng, “Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots,” Mathematical and Computer Modelling, vol. 47, no. 1-2, pp. 140–152, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. F. Li, B. Golden, and E. Wasil, “The open vehicle routing problem: algorithms, large-scale test problems, and computational results,” Computers & Operations Research, vol. 34, no. 10, pp. 2918–2930, 2007. View at Publisher · View at Google Scholar
  11. K. Fleszar, I. H. Osman, and K. S. Hindi, “A variable neighbourhood search algorithm for the open vehicle routing problem,” European Journal of Operational Research, vol. 195, no. 3, pp. 803–809, 2009. View at Publisher · View at Google Scholar
  12. K. Ganesh and T. T. Narendran, “CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up,” European Journal of Operational Research, vol. 178, no. 3, pp. 699–717, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi, “An exact algorithm for the traveling salesman problem with deliveries and collections,” Networks, vol. 42, no. 1, pp. 26–41, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. F. Wang, A. Lim, and Z. Xu, “The one-commodity pickup and delivery travelling salesman problem on a path or a tree,” Networks, vol. 48, no. 1, pp. 24–35, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. P. Toth and D. Vigo, Eds., The Vehicle Routing Problem, P. Toth and D. Vigo, Eds., vol. 9 of SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, Pa, USA, 2002. View at Zentralblatt MATH · View at MathSciNet
  16. “Calculating Permutations and Job Interview Questions,” September 2008, http://www.bearcave.com/random_hacks/permute.html.
  17. S. Kirkpatrick, C. D. Gelatt,, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at PubMed · View at MathSciNet
  18. Pickup-and-Delivery Site: http://webpages.ull.es/users/hhperez/PDsite/index.html.