Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints

DOI10.1016/j.amc.2007.02.141zbMath1119.90079OpenAlexW2004109780MaRDI QIDQ2383860

Jinsheng Shen, Hai-Xing Wang

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.141

zbMATH Keywords

ant colony algorithm (ACA)vehicle routing problem (VRP)Ford-Fulkerson algorithmbipartite graphic modelvehicle scheduling problem with route and fueling time constraints (VSPRFTC)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Electric bus planning \& scheduling: a review of related problems and methodologies ⋮ A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time-space network models ⋮ Variable neighborhood search for optimizing the transportation of agricultural raw materials ⋮ Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ Scheduling the vehicles of bus rapid transit systems: a case study ⋮ Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ Scheduling of Electric Vehicles in the Police Fleet ⋮ A new solution algorithm for improving performance of ant colony optimization ⋮ An exact approach for the multi-depot electric bus scheduling problem with time windows

Cites Work

• Unnamed Item
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• A comparison of different solution approaches to the vehicle scheduling problem in a practical case
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• Vehicle routing problem with time windows and a limited number of vehicles.
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

This page was built for publication: Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints