Communications - Scientific Letters of the University of Zilina 2009, 11(3):36-38 | DOI: 10.26552/com.C.2009.3.36-38

Pickup and Delivery Problem

Jan Pelikan1, Jan Fabry1
1 University of Economics Prague, Czech Republic

Vehicle routing problem and traveling salesman problem are classical problems in operational research; this modification of those problems consists of a transport among nodes of the communication network using cyclical routes of vehicles with a given capacity. A transportation demand is given by the place of pickup, the place of delivery and quantity of goods. The goal is to find cyclical routes of a minimal length which ensure the transport requirements. In the paper there are two models proposed for the problem, both are demonstrated on an example. The problem is based on a case study from practice.

Keywords: pickup and delivery problem, integer programming, heuristic methods

Published: September 30, 2009  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Pelikan, J., & Fabry, J. (2009). Pickup and Delivery Problem. Communications - Scientific Letters of the University of Zilina11(3), 36-38. doi: 10.26552/com.C.2009.3.36-38
Download citation

References

  1. SAVELSBERGH, M., P., M., SOL., M.: The General Pickup and Delivery Problem, Transportation Res. 29, 1995, pp.17-29. Go to original source...
  2. HANG, X., ZHI-LONG, CH., RAJAGOPAL, S., ARUNAPURAM, S.: Solving a Practical Pickup and Delivery Problem, Transportation science, vol. 37, 3/2003, pp. 347-364. Go to original source...
  3. PELIKAN, J.: Discrete Models in Operating Research (in Czech), Professional Publishing.2001, ISBN 80-86419-17-7.

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.