Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach

DOI10.1016/j.cor.2011.04.015zbMath1251.90061OpenAlexW2031528042MaRDI QIDQ1761989

Juan-José Salazar-González, Jorge Riera-Ledesma

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.04.015

zbMATH Keywords

mathematical modelingvehicle routing problembranch-and-cutschool bus routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (22)

The bi-objective traveling purchaser problem with deliveries ⋮ A branch-and-price algorithm for the ring-tree facility location problem ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ The traveling purchaser problem with fast service option ⋮ Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms ⋮ Optimal routing of multimodal mobility systems with ride‐sharing ⋮ The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Fleet management: a vehicle and driver assignment model ⋮ The cumulative school bus routing problem: Polynomial‐size formulations ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ The school bus routing and scheduling problem with transfers ⋮ Weighted matching with pair restrictions ⋮ The traveling purchaser problem and its variants ⋮ The undirected capacitated general routing problem with profits ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ School bus routing—a column generation approach ⋮ Pickup and delivery problem with incompatibility constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the asymmetric traveling purchaser problem
• The school bus routing problem: a review
• A result on projection for the vehicle routing problem
• Travelling purchaser problem
• Parallel branch, cut, and price for large-scale discrete optimization
• The vehicle routing-allocation problem: A unifying framework
• Applications of Linear Programming in the Oil Industry
• The Capacitated m-Ring-Star Problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• The prize collecting traveling salesman problem: II. Polyhedral results

This page was built for publication: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach