Visual attractiveness in routing problems: a review (Q1634050): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact Algorithms for the Clustered Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Districting for Arc Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed capacitated arc routing problem with non-overlapping routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A redistricting problem applied to meter reading in power distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale pickup and delivery work area design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW MEASURE OF RANK CORRELATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waste collection vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary algorithms for periodic arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for the sectoring arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation based heuristic for tactical planning in multi-period vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: District design for arc-routing applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sector design and assignment problem for snow disposal operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective scatter search for a commercial territory design problem / 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 Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New benchmark instances for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis technique for biological shape. I / rank
 
Normal rank

Latest revision as of 17:18, 17 July 2024

scientific article
Language Label Description Also known as
English
Visual attractiveness in routing problems: a review
scientific article

    Statements

    Visual attractiveness in routing problems: a review (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2018
    0 references
    0 references
    visual attractiveness
    0 references
    vehicle routing problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references