The balanced billing cycle vehicle routing problem

DOI10.1002/net.20336zbMath1205.90076OpenAlexW4248839979MaRDI QIDQ3057123

Chris Groër, Edward A. Wasil, Bruce L. Golden

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20336

zbMATH Keywords

meter-reading routes

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (11)

The probabilistic travelling salesman problem with crowdsourcing ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route ⋮ A robust optimization approach to dispatching technicians under stochastic service times ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The rendezvous vehicle routing problem ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ Polynomial-time separation of enhanced reverse multistar inequalities ⋮ Workload equity in vehicle routing: the impact of alternative workload resources ⋮ A template-based adaptive large neighborhood search for the consistent vehicle routing problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The period routing problem
• TSPLIB—A Traveling Salesman Problem Library
• An improved heuristic for the period vehicle routing problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem

This page was built for publication: The balanced billing cycle vehicle routing problem