Visual attractiveness in vehicle routing via bi-objective optimization
From MaRDI portal
Publication:2669616
DOI10.1016/j.cor.2021.105507OpenAlexW3193492264WikidataQ115162883 ScholiaQ115162883MaRDI QIDQ2669616
Claudio Contardo, Diego Rocha, Daniel Aloise, Dario José Aloise
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105507
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The mixed capacitated arc routing problem with non-overlapping routes
- Fuel emissions optimization in vehicle routing problems with time-varying speeds
- Designing delivery districts for the vehicle routing problem with stochastic demands
- NP-hardness of Euclidean sum-of-squares clustering
- The fleet size and mix vehicle routing problem
- Cluster analysis and mathematical programming
- A continuous approach to the design of physical distribution systems
- Visual attractiveness in routing problems: a review
- Variable neighborhood search: basics and variants
- Designing multi-vehicle delivery tours in a grid-cell format
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The bi-objective pollution-routing problem
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Waste collection vehicle routing problem with time windows
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- The Truck Dispatching Problem
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Optimal Routing under Capacity and Distance Restrictions
- Bicriterion Cluster Analysis
- An efficient algorithm for a complete link method
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Solution of a Large-Scale Traveling-Salesman Problem
