A new ILP-based refinement heuristic for vehicle routing problems (Q2583137): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BoneRoute / rank
 
Normal rank
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0662-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081508128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / 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: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential irreducible neighborhoods for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem / 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: Q4532228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential neighbourhood local search for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very large-scale vehicle routing: new test problems, algorithms, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: new polynomial approximation algorithms and domination analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: BoneRoute: An adaptive memory-based method for effective fleet management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3159359 / rank
 
Normal rank

Latest revision as of 14:12, 11 June 2024

scientific article
Language Label Description Also known as
English
A new ILP-based refinement heuristic for vehicle routing problems
scientific article

    Statements

    A new ILP-based refinement heuristic for vehicle routing problems (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    Vehicle Routing Problems
    0 references
    Heuristics
    0 references
    Large Neighborhood Search
    0 references
    Computational Analysis
    0 references
    Distance-Constrained Vehicle Routing Problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers