Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
From MaRDI portal
Publication:336558
DOI10.1016/j.cor.2013.01.009zbMath1348.90102OpenAlexW2004907083MaRDI QIDQ336558
Jean-Charles Billaut, S. Perrin, Yannick Kergosien, Christophe Lenté
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.009
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (3)
Modeling and improving the logistic distribution network of a hospital ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Two-echelon vehicle routing problems: a literature review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Planning models for freight transportation
- The periodic vehicle routing problem with intermediate facilities
- Evolutionary algorithms for periodic arc routing problems
- Future paths for integer programming and links to artificial intelligence
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Scheduling logistic activities to improve hospital supply systems
- Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Split delivery routing
- Scheduling linen deliveries in a large hospital
- What you should know about the vehicle routing problem
- The Split Delivery Vehicle Routing Problem: A Survey
- The Fixed Job Schedule Problem with Spread-Time Constraints
- Savings by Split Delivery Routing
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Networks and vehicle routing for municipal waste collection
This page was built for publication: Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
