The prisoner transportation problem
DOI10.1016/J.EJOR.2020.01.027zbMATH Open1441.90025OpenAlexW3000075089WikidataQ126335775 ScholiaQ126335775MaRDI QIDQ2178139FDOQ2178139
Authors: Jan Christiaens, T. Wauters, Reshma Chirayil Chandrasekharan, Hatice Calik, Greet Vanden Berghe
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/648520
Recommendations
vehicle routingmulti-compartmentinter-passenger conflictsprisoner transportation problemsimultaneous servicing
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Optimization by simulated annealing
- Scheduling with batching: A review
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Record breaking optimization results using the ruin and recreate principle
- Dynamic transportation of patients in hospitals
- The dial-a-ride problem: Models and algorithms
- A tabu search approach for the livestock collection problem
- Solving a rich vehicle routing and inventory problem using column generation
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Vehicle routing with compartments: applications, modelling and heuristics
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Title not available (Why is that?)
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- An efficient implementation of local search algorithms for constrained routing problems
- Bounded vertex colorings of graphs
- Resource constrained routing and scheduling: review and research prospects
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
Cited In (2)
This page was built for publication: The prisoner transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178139)