The selective pickup and delivery problem: Formulation and a memetic algorithm
CK Ting, XL Liao - International Journal of Production Economics, 2013 - Elsevier
The pickup and delivery problem addresses the real-world issues in logistic industry and
establishes an important category of vehicle routing problems. The problem is to find the …
establishes an important category of vehicle routing problems. The problem is to find the …
[PDF][PDF] A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with TimeWindows and Job-Teaming Constraints
This paper investigates the manpower allocation problem with time windows and job-
teaming constraints (MAPTWTC), a practical scheduling and routing problem that tries to …
teaming constraints (MAPTWTC), a practical scheduling and routing problem that tries to …
[PDF][PDF] An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
H Sumita, Y Yonebayashi, N Kakimura… - IJCAI, 2017 - ijcai.org
This paper focuses on a generalization of the traveling salesman problem (TSP), called the
subpath planning problem (SPP). Given 2n vertices and n independent edges on a metric …
subpath planning problem (SPP). Given 2n vertices and n independent edges on a metric …
Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach
The pickup and delivery traveling salesman problem with last-in-first-out loading (TSPPDL)
requires that a set of pickup and delivery requests are fulfilled such that the items to be …
requires that a set of pickup and delivery requests are fulfilled such that the items to be …
Exact and Heuristic Methods for Emerging Vehicle Routing Problems
E Oden - 2022 - search.proquest.com
The rise of global supply chains and e-commerce in recent decades have intensified the
relevance of the transportation industry to both the individual and the economy. With rising …
relevance of the transportation industry to both the individual and the economy. With rising …