Solving the VRP Using a Column-Generation Approach

David Simchi-Levi, Xin Chen, Julien Bramel

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

A classical method, first suggested by Balinski and Quandt (1964), for solving the VRP with capacity and time-window constraints, is based on formulating the problem as a set-partitioning problem.

Original languageEnglish (US)
Title of host publicationSpringer Series in Operations Research and Financial Engineering
PublisherSpringer Nature
Pages359-375
Number of pages17
DOIs
StatePublished - 2014

Publication series

NameSpringer Series in Operations Research and Financial Engineering
ISSN (Print)1431-8598
ISSN (Electronic)2197-1773

Keywords

  • Linear Relaxation
  • Optimal Integer Solution
  • Solve Crew Scheduling Problems
  • Time Window Constraints
  • Vehicle Routing Problem

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics
  • Control and Optimization
  • Information Systems and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Solving the VRP Using a Column-Generation Approach'. Together they form a unique fingerprint.

Cite this