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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the nonpreemptive swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bike sharing systems: solving the static rebalancing problem / 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: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: an application to the index tracking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: First vs. best improvement: an empirical study / 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: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / 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: The multi-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem with pick-up and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study on the benefit of split loads with the pickup and delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-interchange procedures for local search in a precedence-constrained routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem / rank
 
Normal rank

Revision as of 16:08, 12 July 2024

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

    Statements

    A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (English)
    0 references
    7 October 2016
    0 references
    pickup-and-delivery
    0 references
    hybrid approach
    0 references
    traveling salesman
    0 references
    local search
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references