The following pages link to (Q4452900):
Displaying 50 items.
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Solving a concrete sleepers production scheduling by genetic algorithms (Q863974) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- Iterated tabu search for the car sequencing problem (Q932213) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- People detection through quantified fuzzy temporal rules (Q962696) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
- Scheduling projects with limited number of preemptions (Q1025235) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- Improved heuristic algorithms for the job sequencing and tool switching problem (Q1651541) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- New heuristics for the bicluster editing problem (Q1686528) (← links)
- Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect (Q1687634) (← links)
- Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673) (← links)
- The green location-routing problem (Q1722977) (← links)
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
- Efficient metaheuristics for the mixed team orienteering problem with time windows (Q1736755) (← links)
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse (Q1740491) (← links)
- Methods for solving road network problems with disruptions (Q1742219) (← links)
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem (Q1752254) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain (Q1926728) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
