A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
From MaRDI portal
Publication:6167423
DOI10.1016/j.ejor.2022.11.006MaRDI QIDQ6167423
Roberto Baldacci, Gongshu Wang, Lixin Tang, Baobin Huang, Defeng Sun
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- The multiple vehicle pickup and delivery problem with LIFO constraints
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- The pickup and delivery problem with time windows and handling operations
- A metaheuristic for the time-dependent pollution-routing problem
- The pickup and delivery traveling salesman problem with handling costs
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- A unified exact method for solving different classes of vehicle routing problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Routing a Heterogeneous Fleet of Vehicles
- Optimal Torpedo Scheduling
- An Exchange Heuristic for Routeing Problems with Time Windows
- Solving the Torpedo Scheduling Problem
- Handbook of metaheuristics
- A review of planning and scheduling systems and methods for integrated steel production
This page was built for publication: A metaheuristic algorithm for a locomotive routing problem arising in the steel industry