scientific article; zbMATH DE number 3621663
From MaRDI portal
Publication:4184789
Cited in
(29)- A useful transform of standard input data for a classical NP-complete problem
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Selection of Vehicle Routing Heuristic Using Neural Networks
- All solutions of the Soma cube puzzle
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- An exact algorithm for large multiple knapsack problems
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- New imperialist competitive algorithm to solve the travelling salesman problem
- Upper and lower bounds for the single source capacitated location problem.
- Analysis of a flow problem with fixed charges
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics
- The balanced billing cycle vehicle routing problem
- A matheuristic approach for the pollution-routing problem
- Topological design of ring networks
- An algorithm for the traveling salesman problem with pickup and delivery customers
- An evolutionary algorithm for the vehicle routing problem with route balancing
- The Minimum Spanning Tree Problem with Time Window Constraints
- The node-weighted steiner tree problem
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- The travelling salesman problem: selected algorithms and heuristics†
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A generalized exchange heuristic for the capacitated vehicle routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184789)
