The following pages link to Handbook of metaheuristics (Q5916277):
Displaying 26 items.
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- A hybrid dynamic programming -- Tabu search approach for the long-term hydropower scheduling problem (Q2051172) (← links)
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
- A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war (Q2149602) (← links)
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling (Q2177824) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback (Q2695103) (← links)
- Characterization of electromagnetic parameters through inversion using metaheuristic technique (Q5153275) (← links)
- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
- Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by <i>bestial</i> metaphors (Q6056878) (← links)
- Planning of logistics missions of the ``UAV+vehicle'' hybrid systems (Q6066032) (← links)
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows (Q6079872) (← links)
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- Applying topological data analysis to local search problems (Q6154230) (← links)
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151) (← links)
