An adaptive memory programming method for risk logistics operations
From MaRDI portal
Recommendations
- Adaptive memory programming for the robust capacitated international sourcing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem
- scientific article; zbMATH DE number 2209664
- Adaptive memory programming for constrained global optimization
- Adaptive search and the management of logistics systems. Base models for learning agents
- Optimization in identification of logical-probabilistic risk models
Cites work
- A framework for the description of evolutionary algorithms
- A note on two problems in connexion with graphs
- Adaptive memory programming: a unified view of metaheuristics
- Air traffic knowledge management policy
- BoneRoute: An adaptive memory-based method for effective fleet management
- Catastrophe avoidance models for hazardous materials route planning
- Computer Solutions of the Traveling Salesman Problem
- Genetic search methods in air traffic control
- Modeling rolling batch planning as vehicle routing problem with time windows.
- Optimal location of routes for vehicles transporting hazardous materials
- Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees.
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
- Probabilistic diversification and intensification in local search for vehicle routing
- Routing trains through a railway station based on a node packing model
- Routing trains through railway stations: Complexity issues
- Siting noxious facilities under uncertainty
- Solving the vehicle routing problem with adaptive memory programming methodology
- Survey of mathematical programming models in air pollution management
- The savings algorithm for the vehicle routing problem
- The wafer probing scheduling problem (WPSP)
Cited in
(3)
This page was built for publication: An adaptive memory programming method for risk logistics operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678215)