A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The capacitated team orienteering and profitable tour problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-vehicle profitable pickup and delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single vehicle routing problem with deliveries and selective pickups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the capacitated profitable tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified heuristic for a large class of vehicle routing problems with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries / rank
 
Normal rank

Revision as of 03:49, 19 July 2024

scientific article; zbMATH DE number 7051707
Language Label Description Also known as
English
A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
scientific article; zbMATH DE number 7051707

    Statements

    A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (English)
    0 references
    0 references
    0 references
    7 May 2019
    0 references
    vehicle routing problem with pickup and delivery
    0 references
    profitable tour problem
    0 references
    reverse logistic
    0 references
    adaptive large neighborhood search
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers

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