Recommendations
Cites work
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A tabu search approach for the livestock collection problem
- An efficient implementation of local search algorithms for constrained routing problems
- Bounded vertex colorings of graphs
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- Dynamic transportation of patients in hospitals
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- 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
- Optimization by simulated annealing
- Record breaking optimization results using the ruin and recreate principle
- Resource constrained routing and scheduling: review and research prospects
- Scheduling with batching: A review
- Solving a rich vehicle routing and inventory problem using column generation
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem: Models and algorithms
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Vehicle routing with compartments: applications, modelling and heuristics
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)
