Vehicle routing via column generation (Q1058983): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(85)90089-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973204750 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Vehicle routing via column generation
scientific article

    Statements

    Vehicle routing via column generation (English)
    0 references
    0 references
    0 references
    1985
    0 references
    This paper explores an approximate method for solving a routing problem in a four-level distribution which has ''double-ended'' demand. Routes are represented as columns in a linear program and column generation is used to improve the solution by generating new routes. The generation of new routes is based on an LP subproblem. Its solution is rounded down to integer values to insure its feasibility as a route for inclusion in the restricted master problem. Finally, an illustrative problem is solved.
    0 references
    vehicle routing
    0 references
    column generation
    0 references
    double-ended demand
    0 references
    approximate method
    0 references
    four-level distribution
    0 references

    Identifiers