Pickup and Delivery Problem
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2009-09-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-200903-0007_pickup-and-delivery-problem.php |
| _version_ | 1797847030899408896 |
|---|---|
| author | Jan Pelikan Jan Fabry |
| author_facet | Jan Pelikan Jan Fabry |
| author_sort | Jan Pelikan |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-09T18:04:49Z |
| format | Article |
| id | doaj.art-6bbb3dcdb07b4c60b770f7fb233dd0fc |
| institution | Directory Open Access Journal |
| issn | 1335-4205 2585-7878 |
| language | English |
| last_indexed | 2024-04-09T18:04:49Z |
| publishDate | 2009-09-01 |
| publisher | University of Žilina |
| record_format | Article |
| series | Communications |
| spelling | doaj.art-6bbb3dcdb07b4c60b770f7fb233dd0fc2023-04-14T06:30:09ZengUniversity of ŽilinaCommunications1335-42052585-78782009-09-01113363810.26552/com.C.2009.3.36-38csl-200903-0007Pickup and Delivery ProblemJan Pelikan0Jan Fabry1University of Economics Prague, Czech RepublicUniversity of Economics Prague, Czech RepublicVehicle 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.https://komunikacie.uniza.sk/artkey/csl-200903-0007_pickup-and-delivery-problem.phppickup and delivery probleminteger programmingheuristic methods |
| spellingShingle | Jan Pelikan Jan Fabry Pickup and Delivery Problem Communications pickup and delivery problem integer programming heuristic methods |
| title | Pickup and Delivery Problem |
| title_full | Pickup and Delivery Problem |
| title_fullStr | Pickup and Delivery Problem |
| title_full_unstemmed | Pickup and Delivery Problem |
| title_short | Pickup and Delivery Problem |
| title_sort | pickup and delivery problem |
| topic | pickup and delivery problem integer programming heuristic methods |
| url | https://komunikacie.uniza.sk/artkey/csl-200903-0007_pickup-and-delivery-problem.php |
| work_keys_str_mv | AT janpelikan pickupanddeliveryproblem AT janfabry pickupanddeliveryproblem |