Similar Search Results

A generalized model and a heuristic algorithm for the large-scale covering tour problem

Murakami, Keisuke - In: RAIRO / Operations research 52 (2018) 2, pp. 577-594

Persistent link: https://www.econbiz.de/10011987117

The bi-objective traveling purchaser problem with deliveries

Palomo-Martínez, Pamela J.; Salazar-Aguilar, M. Angélica - In: European journal of operational research : EJOR 273 (2019) 2, pp. 608-622

Persistent link: https://www.econbiz.de/10011987567

Heuristic algorithms for the single allocation p-hub center problem with routing considerations

Kartal, Zühal; Krishnamoorthy, Mohan; Ernst, Andreas T. - In: OR spectrum : quantitative approaches in management 41 (2019) 1, pp. 99-145

Persistent link: https://www.econbiz.de/10011992514

A branch-and-price algorithm for two mutli-compartment vehicle routing problems

Mirzaei, Samira; Wøhlk, Sanne - In: EURO journal on transportation and logistics 8 (2019) 1, pp. 1-33

Persistent link: https://www.econbiz.de/10011997284

A traveling salesman problem with pickups and deliveries and stochastic travel times : an application from chemical shipping

Elgesem, Aurora Smith; Skogen, Eline Sophie; Wang, Xin; … - In: European journal of operational research : EJOR 269 (2018) 3, pp. 844-859

Persistent link: https://www.econbiz.de/10011866669

Using a heuristic algorithm to design a personalized day tour route in a time-dependent stochastic environment

Liao, Zhixue; Zheng, Weimin - In: Tourism management : research, policies, practice 68 (2018), pp. 284-300

Persistent link: https://www.econbiz.de/10011871191

Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem

Pereira, Dilson Lucas; Cunha, Alexandre Salles da - In: Computers & operations research : and their … 98 (2018), pp. 38-55

Persistent link: https://www.econbiz.de/10011886756

A cluster first-route second approach for a capacitated vehicle routing problem : a case study

Comert, Serap Ercan; Yazgan, Harun Resit; Kır, Sena; … - In: International journal of procurement management 11 (2018) 4, pp. 399-419

Persistent link: https://www.econbiz.de/10011966109

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem

Lu, Yongliang; Benlic, Una; Wu, Qinghua - In: Computers & operations research : and their … 101 (2019), pp. 285-297

Persistent link: https://www.econbiz.de/10011947964

The split delivery vehicle routing problem with three-dimensional loading constrains

Bortfeldt, Andreas; Yi, Junmin - 2018

search algorithm for routing and a genetic algorithm and several construction heuristics for packing. Numerical experiments …The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle … routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers …

Persistent link: https://www.econbiz.de/10011952649