A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2012.08.032 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.08.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162812011 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q38810048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Period Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and vehicle routing for municipal waste collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the period traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the period traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the period vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Period Vehicle Routing Problem and its Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic for the Periodic Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-depot period vehicle routing problem arising in the utilities sector / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search heuristic for periodic routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delivery strategies for blood products supplies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation based Primal Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period traveling salesman problem: A new heuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiphase approach to the period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2012.08.032 / rank
 
Normal rank

Latest revision as of 16:36, 9 December 2024

scientific article
Language Label Description Also known as
English
A set-covering based heuristic algorithm for the periodic vehicle routing problem
scientific article

    Statements

    A set-covering based heuristic algorithm for the periodic vehicle routing problem (English)
    0 references
    8 September 2014
    0 references
    periodic vehicle routing
    0 references
    matheuristics
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers