A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10732-012-9210-x / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-012-9210-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040371063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / 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: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended formulations for the precedence constrained asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem / 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: Models for the single-vehicle preemptive pickup and delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10732-012-9210-X / rank
 
Normal rank

Latest revision as of 04:52, 18 December 2024

scientific article
Language Label Description Also known as
English
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
scientific article

    Statements

    A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (English)
    0 references
    27 June 2017
    0 references
    pickup and delivery
    0 references
    traveling salesman problem
    0 references
    hybrid heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers