The following pages link to Kenneth Sörensen (Q257204):
Displaying 50 items.
- Optimisation of gravity-fed water distribution network design: a critical review (Q257205) (← links)
- Measuring and rewarding flexibility in collaborative distribution, including two-partner coalitions (Q297087) (← links)
- (Q319072) (redirect page) (← links)
- Home care service planning. The case of Landelijke Thuiszorg (Q319073) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
- The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- A GRASP metaheuristic to improve accessibility after a disaster (Q647512) (← links)
- Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning (Q726254) (← links)
- Multi-objective optimization of mobile phone keymaps for typing messages using a word list (Q864000) (← links)
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- A Petri net model of a continuous flow transfer line with unreliable machines. (Q1410338) (← links)
- Data mining with genetic algorithms on binary trees. (Q1410608) (← links)
- A framework for robust and flexible optimisation using metaheuristics, with applications in supply chain design (Q1421051) (← links)
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- An algorithmic framework for generating optimal two-stratum experimental designs (Q1658390) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation (Q1754264) (← links)
- Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← links)
- Finding robust solutions using local search (Q1876602) (← links)
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates (Q1885338) (← links)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances (Q2108111) (← links)
- A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem (Q2147067) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- The accessibility arc upgrading problem (Q2253452) (← links)
- A network-consistent time-dependent travel time layer for routing optimization problems (Q2253582) (← links)
- A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
- A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
- An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions (Q2389938) (← links)
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
- A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
- An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm (Q2631342) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization (Q2669525) (← links)
- The real-time on-demand bus routing problem: the cost of dynamic requests (Q2676345) (← links)
- On the Conversion of Program Specifications into Pseudo Code using Jackson Structured Programming (Q2744750) (← links)
