Minimizing customers' waiting time in a vehicle routing problem with unit demands

DOI10.1134/S1064230715040024zbMath1390.90476MaRDI QIDQ1742415

F. Angel-Bello Acosta, Y. Cardona-Valdes, S. Nucamendi

Publication date: 11 April 2018

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

New formulations and solution approaches for the latency location routing problem ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two improved formulations for the minimum latency problem
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Solving capacitated clustering problems
• Improved bounds for vehicle routing solutions
• Combined route capacity and route length models for unit demand vehicle routing problems
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A new formulation for the traveling deliveryman problem
• Polyhedral results for a vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• An improved approximation ratio for the minimum latency problem
• A branch-and-cut algorithm for vehicle routing problems
• Transportation problems with a minimax criterion
• A minimax under nonlinear transportation constraints.
• Open transportation models with a minimax criterion.
• Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A simple and effective metaheuristic for the minimum latency problem
• Variable neighborhood search for the travelling deliveryman problem
• A genetic algorithm for finding a salesman's route
• The time dependent traveling salesman problem: polyhedra and algorithm
• A computational tool for optimizing the urban public transport: A real application
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Iterative functional modification method for solving a transportation problem
• Ant colony optimization algorithms for solving transportation problems
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Black and White Traveling Salesman Problem
• Bounds and Heuristics for Capacitated Routing Problems
• On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
• Special cases of traveling salesman and repairman problems with time windows
• TSPLIB—A Traveling Salesman Problem Library
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• The Delivery Man Problem and Cumulative Matroids
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• The k -traveling repairmen problem
• Exact Algorithms for the Clustered Vehicle Routing Problem
• On clustering validation techniques

This page was built for publication: Minimizing customers' waiting time in a vehicle routing problem with unit demands