Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities

DOI10.1016/j.ejor.2017.07.067zbMath1374.90067MaRDI QIDQ1681274

Michael Schneider, Gilbert Laporte, Maximilian Schiffer

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

routinglocation-routingintermediate stopsintra-route facilities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, A survey of adaptive large neighborhood search algorithms and applications, The electric vehicle routing problem with shared charging stations, Location‐routing problem: a classification of recent research, A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method, A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows, Winner determination with sustainable-flexible considerations under demand uncertainty in transportation service procurement auctions, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers, Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks, The location routing problem using electric vehicles with constrained distance

Cites Work

• Unnamed Item
• Routing a mixed fleet of electric and conventional vehicles
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A survey on two-echelon routing problems
• Battery swap station location-routing problem with capacitated electric vehicles
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An adaptive large neighborhood search for an E-grocery delivery routing problem
• The multi-depot vehicle routing problem with inter-depot routes
• A general heuristic for vehicle routing problems
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• The periodic vehicle routing problem with intermediate facilities
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
• The electric location routing problem with time windows and partial recharging
• k-interchange procedures for local search in a precedence-constrained routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
• Waste collection vehicle routing problem with time windows
• A unified solution framework for multi-attribute vehicle routing problems
• A memetic algorithm for the orienteering problem with hotel selection
• A variable neighborhood search branching for the electric vehicle routing problem with time windows
• The capacitated arc routing problem with refill points
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows