Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Large-Scale Advance-Request Dial-A-Ride Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Vehicle Routing Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the traveling salesman problem with pickup and delivery customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of local search algorithms for constrained routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extension of local search applied to the Dial-A-Ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing: A tool for operational research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms-a Tool for OR? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmes génétiques hybrides pour l'optimisation combinatoire / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:44, 4 June 2024

scientific article
Language Label Description Also known as
English
Perturbation heuristics for the pickup and delivery traveling salesman problem
scientific article

    Statements

    Perturbation heuristics for the pickup and delivery traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2002
    0 references
    0 references
    0 references
    0 references