Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure

DOI10.1287/ijoc.2015.0649zbMath1338.90059OpenAlexW2188576392MaRDI QIDQ2802246

Rafael Martinelli, Claudio Contardo

Publication date: 25 April 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2015.0649

zbMATH Keywords

branch and cuthybrid metaheuristicangle capacitated vehicle routing problemcapacitated vehicle routing problem with reload costsquadratic capacitated vehicle routing problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Distributed asynchronous column generation ⋮ Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times

Uses Software

• Knapsack
• Concorde
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A hybrid algorithm for a class of vehicle routing problems
• On minimum reload cost cycle cover
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Facet identification for the symmetric traveling salesman polytope
• The minimum reload \(s-t\) path, trail and walk problems
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• A result on projection for the vehicle routing problem
• On certain polytopes associated with graphs
• A computational comparison of flow formulations for the capacitated location-routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• The symmetric quadratic traveling salesman problem
• Solving an urban waste collection problem using ants heuristics
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Implicit depot assignments and rotations in vehicle routing heuristics
• The Truck Dispatching Problem
• A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• On minimum reload cost paths, tours, and flows
• On the symmetric travelling salesman problem I: Inequalities
• Optimal Routing under Capacity and Distance Restrictions
• Multi-Terminal Network Flows
• On the symmetric travelling salesman problem: A computational study
• Quadratic knapsack problems
• Disjoint paths in a network
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Exact Solution of the Quadratic Knapsack Problem
• Provably good solutions for the traveling salesman problem
• The Angular-Metric Traveling Salesman Problem
• Paths, Trees, and Flowers
• Integer Programming and Combinatorial Optimization

This page was built for publication: Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure