A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2012.01.036 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156449943 / rank
 
Normal rank
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: Attraction probabilities in variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation analysis of efficient heuristic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the traveling salesman problem with pickup and delivery / 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: Routing a vehicle of capacity greater than one / 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: Variable neighbourhood search: methods and applications / 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 one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / 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 general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential search and its application to vehicle-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / 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: Variable neighborhood search / 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: A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2012.01.036 / rank
 
Normal rank

Latest revision as of 13:00, 16 December 2024

scientific article
Language Label Description Also known as
English
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
scientific article

    Statements

    A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    variable neighborhood search
    0 references
    pickup-and-delivery travelling salesman problem
    0 references
    0 references

    Identifiers