Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
From MaRDI portal
Publication:6092634
DOI10.1002/net.21993WikidataQ104486744 ScholiaQ104486744MaRDI QIDQ6092634
No author found.
Publication date: 23 November 2023
Published in: Networks (Search for Journal in Brave)
multi-objective optimizationvehicle routinginconsistencyadaptive large neighborhood searchmulti-graphepsilon box splitting heuristic
Related Items (1)
Cites Work
- A note on two problems in connexion with graphs
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Pricing routines for vehicle routing with time windows on road networks
- Multi-directional local search
- A lower bound for the node, edge, and arc routing problem
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- Modeling and solving the mixed capacitated general routing problem
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
- A general heuristic for vehicle routing problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Vehicle routing with arrival time diversification
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- A heuristic approach to the overnight security service problem
- The vehicle routing problem with arrival time diversification on a multigraph
- Finding representative systems for discrete bicriterion optimization problems
- A unified solution framework for multi-attribute vehicle routing problems
- The mixed capacitated general routing problem under uncertainty
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
- A fundamental problem in vehicle routing
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- A heuristic for the vehicle routing problem with time windows
This page was built for publication: Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs