A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-008-0072-x / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068123526 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-008-0072-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068123526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some matching problems arising in vehicle scheduling models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified tabu search heuristic for vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-depot vehicle scheduling problems with time windows and waiting costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for multiple depot bus scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Single-Depot Vehicle Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space network based exact optimization model for multi-depot bus scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Scheduling in Public Transit and Lagrangean Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank

Latest revision as of 21:54, 1 July 2024

scientific article
Language Label Description Also known as
English
A comparison of five heuristics for the multiple depot vehicle scheduling problem
scientific article

    Statements

    A comparison of five heuristics for the multiple depot vehicle scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    vehicle scheduling
    0 references
    multiple depot
    0 references
    heuristics
    0 references
    branch-and-cut
    0 references
    column generation
    0 references
    Lagrangian heuristic
    0 references
    tabu search
    0 references
    large neighborhood search
    0 references

    Identifiers