The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach

DOI10.1016/j.ejor.2012.01.035zbMath1253.90161OpenAlexW2075270503MaRDI QIDQ1926737

Wenbin Zhu, Hu Qin, Andrew E. B. Lim, Zi-Zhen Zhang

Publication date: 29 December 2012

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.035

zbMATH Keywords

branch and boundvehicle routing problemtoll-by-weight

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (3)

An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A toll evasion recognition method based on Gaussian mixture clustering

Uses Software

• TSPLIB
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for the minimum latency problem
• The delivery man problem on a tree network
• Solving the car sequencing problem via branch \& bound
• A new formulation for the traveling deliveryman problem
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• A new dominance procedure for combinatorial optimization problems
• An improved approximation ratio for the minimum latency problem
• The traveling salesman problem and its variations
• The Vehicle Routing Problem
• The minimum latency problem
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• TSPLIB—A Traveling Salesman Problem Library
• The Delivery Man Problem and Cumulative Matroids
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• Approximation Schemes for Minimum Latency Problems
• On Representatives of Subsets
• A note on the traveling repairman problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• The traveling salesman problem with cumulative costs

This page was built for publication: The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach