Similar Search Results

Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem

Zhao, Jingyi; Poon, Mark; Zhang, Zhenzhen; Gu, Ruixue - In: Computers & operations research : and their … 147 (2022), pp. 1-16

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

Combining Benders decomposition and column generation for the petrol station replenishment problem with inventory management

Bani, Abderrahman; Er Raqabi, El Mehdi; El Hallaoui, Issmail - 2024

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

Exact and heuristic approaches to Truck-Drone Delivery Problems

Freitas, Júlia C.; Penna, Puca Huachi Vaz; Toffolo, … - In: EURO journal on transportation and logistics 12 (2023), pp. 1-15

to obtain high-quality solutions for large-size instances. The efficiency of the algorithm was evaluated on 1415 …

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

The stochastic test collection problem : models, exact and heuristic solution approaches

Douek-Pinkovich, Yifat; Ben-Gal, Irad; Raviv, Tal - In: European journal of operational research : EJOR 299 (2022) 3, pp. 945-959

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

Vehicle routing problem with uniform private fleet and common carrier : a node subset heuristic

Pelikán, Jan; Štourač, Petr; Sokol, Ondřej - In: Central European journal of operations research 30 (2022) 2, pp. 683-697

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

Open vehicle routing problem with split deliveries : mathematical formulations and a cutting-plane method

Ruiz y Ruiz, Efraín; García-Calvillo, Irma; … - In: Operational research : an international journal 22 (2022) 2, pp. 1017-1037

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

Deep Dual-Optimal Inequalities for Generalized Capacitated Fixed-Charge Network Design Problems

Koza, David Franz; Hellsten, Erik Orm; Pisinger, David - 2020

Capacitated fixed-charge network design problems and generalizations, such as service network design problems, have a wide range of applications but are known to be very difficult to solve. Many exact and heuristic algorithms to solve these problems rely on column-and-row generation (CRG), which...

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

A fresh look at the traveling salesman problem with a center

Luo, Yuchen; Golden, Bruce; Poikonen, Stefan; Zhang, Rui - In: Computers & operations research : and their … 143 (2022), pp. 1-14

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

Team orienteering with time-varying profit

Yu, Qinxiao; Adulyasak, Yossiri; Rousseau, Louis-Martin; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 1, pp. 262-280

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

A MILP approach combined with clustering to solve a special petrol station replenishment problem

Hajba, Tamás; Horváth, Zoltán; Heitz, Dániel; … - In: Central European journal of operations research 32 (2024) 1, pp. 95-107

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