The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
From MaRDI portal
Publication:320620
DOI10.1016/J.EJOR.2015.06.082zbMATH Open1346.90139OpenAlexW1583403835MaRDI QIDQ320620FDOQ320620
Çağrı Koç, G. Laporte, Tolga Bektaş, Ola Jabali
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/378590/1/Paper3_EJORRevision.pdf
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Solution of a Large-Scale Traveling-Salesman Problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Combined location-routing problems: A synthesis and future research directions
- Heuristic solutions to multi-depot location-routing problems
- A compact model and tight bounds for a combined location-routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A survey of recent research on location-routing problems
- Integer Programming: Methods, Uses, Computations
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Title not available (Why is that?)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- Industrial aspects and literature survey: fleet composition and routing
- A unified exact method for solving different classes of vehicle routing problems
- A survey of variants and extensions of the location-routing problem
- The fleet size and mix vehicle routing problem with time windows
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
- A branch-and-cut algorithm for the plant-cycle location problem
Cited In (20)
- Title not available (Why is that?)
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- The fleet size and mix vehicle routing problem with time windows
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- Flexible two-echelon location routing problem
- Multiobjective location routing problem considering uncertain data after disasters
- A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- Fleet sizing of reusable articles under uncertain demand and turnaround times
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects
- A survey of adaptive large neighborhood search algorithms and applications
- An improved edge recombination algorithm for scheduling problems of drone package delivery
- The electric vehicle routing problem with shared charging stations
- Location‐routing problem: a classification of recent research
- A location-or-routing problem with partial and decaying coverage
- Electric vehicles fast charger location-routing problem under ambient temperature
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
This page was built for publication: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320620)
