Visual attractiveness in routing problems: a review

DOI10.1016/j.cor.2018.10.012zbMath1458.90134OpenAlexW2897864152MaRDI QIDQ1634050

Daniele Vigo, Diego Gabriel Rossit, Mariano Frutos, Fernando A. Tohmé

Publication date: 17 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11336/103527

zbMATH Keywords

vehicle routing problemvisual attractiveness

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Visual attractiveness in vehicle routing via bi-objective optimization, A concise guide to existing and emerging vehicle routing problem variants, Dynamic community partitioning for e-commerce last mile delivery with time window constraints, Arc routing problems: A review of the past, present, and future, Multiple criteria analysis of the popularity and growth of research and practice of visual analytics, and a forecast of the future trajectory, Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, Unnamed Item

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The mixed capacitated arc routing problem with non-overlapping routes
• A redistricting problem applied to meter reading in power distribution networks
• Large-scale pickup and delivery work area design
• Heuristic methods for the sectoring arc routing problem
• New benchmark instances for the capacitated vehicle routing problem
• Multiobjective scatter search for a commercial territory design problem
• Evolutionary algorithms for periodic arc routing problems
• A tabu search heuristic and adaptive memory procedure for political districting
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• The sector design and assignment problem for snow disposal operations
• Lower and upper bounds for the mixed capacitated arc routing problem
• Waste collection vehicle routing problem with time windows
• An efficient algorithm for determining the convex hull of a finite planar set
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS
• Vehicle Routing
• Districting for Arc Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• TSPLIB—A Traveling Salesman Problem Library
• An analysis technique for biological shape. I
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• District design for arc-routing applications
• Exact Algorithms for the Clustered Vehicle Routing Problem
• The Traveling-Salesman Problem
• A NEW MEASURE OF RANK CORRELATION