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: | Jan Pelikan, Jan Fabry |
---|---|
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 |
Similar Items
-
A Selective Many-to-Many Pickup and Delivery Problem With Handling Cost in the Omni-Channel Last-Mile Delivery
by: Yali Li
Published: (2022-01-01) -
Online Optimization of Pickup and Delivery Problem Considering Feasibility
by: Ryo Matsuoka, et al.
Published: (2024-02-01) -
Mixed Integer Linear Programming Models to Solve a Real-Life Vehicle Routing Problem with Pickup and Delivery
by: Ali Louati, et al.
Published: (2021-10-01) -
Efficient algorithms for optimal pickup-point selection in the selective pickup and delivery problem with time-window constraints
by: Yosuke TAKADA, et al.
Published: (2020-07-01) -
Heuristic Algorithms for Heterogeneous and Multi-Trip Electric Vehicle Routing Problem with Pickup and Delivery
by: Li Wang, et al.
Published: (2024-02-01)