An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s10288-012-0207-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093269603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for the vehicle routing problem with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to the double travelling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:56, 5 July 2024

scientific article
Language Label Description Also known as
English
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
scientific article

    Statements

    An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    traveling salesman problem
    0 references
    clusters
    0 references
    heuristics
    0 references

    Identifiers