Zobrazeno 1 - 10 of 10 pro vyhledávání: '"Said Dabia"'
1
The Inventory Routing Problem with Demand Moves
Autor: Guy Desaulniers, Said Dabia, Wout Dullaert, Annelieke C. Baller
Publikováno v: SN Operations Research Forum, 2(1):6, 1-61. Springer
Baller, A C, Dabia, S, Desaulniers, G & Dullaert, W E H 2021, ' The Inventory Routing Problem with Demand Moves ', SN Operations Research Forum, vol. 2, no. 1, 6, pp. 1-61 . https://doi.org/10.1007/s43069-020-00042-z
In the Inventory Routing Problem, customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize total routing and inventory holding cost over a time horizon. If the customers are located rela
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0808462ef5e7f171e1b64b97f90baef5
https://doi.org/10.1007/s43069-020-00042-z
Zobrazit plný text záznamu
2
Cover inequalities for a vehicle routing problem with time windows and shifts
Autor: Said Dabia, Stefan Ropke, Tom Van Woensel
Publikováno v: Transportation Science, 53(5), 1354-1371. INFORMS Inst.for Operations Res.and the Management Sciences
Dabia, S, Ropke, S & Van Woensel, T 2019, ' Cover inequalities for a vehicle routing problem with time windows and shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
Transportation Science, 53(5), 1354-1371. INFORMS Institute for Operations Research and the Management Sciences
Dabia, S, Røpke, S & van Woensel, T 2019, ' Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
This paper introduces the vehicle routing problem with time windows and shifts (VRPTWS). At the depot, several shifts with nonoverlapping operating periods are available to load the planned trucks. Each shift has a limited loading capacity. We solve
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff8b4f1a8af99d99668caa11e478ea26
https://doi.org/10.1287/trsc.2018.0885
Zobrazit plný text záznamu
3
The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs
Autor: Wout Dullaert, Annelieke C. Baller, Daniele Vigo, Said Dabia
Publikováno v: Baller, A C, Dabia, S, Dullaert, W E H & Vigo, D 2019, ' The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs ', European Journal of Operational Research, vol. 276, no. 3, pp. 1013-1033 . https://doi.org/10.1016/j.ejor.2019.01.070
European Journal of Operational Research, 276(3), 1013-1033. Elsevier
In a vendor-managed inventory setting, a supplier determines the timing and size of replenishments for its customers. In the Dynamic-Demand Joint Replenishment Problem (DJRP), one assumes that the supplier pays a fixed fee for replenishing a customer
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9507bbcc0d9b42ef5166a7ac4d05e33a
https://doi.org/10.1016/j.ejor.2019.01.070
Zobrazit plný text záznamu
4
An exact algorithm for a rich vehicle routing problem with private fleet and common carrier
Autor: Said Dabia, Daniele Vigo, David S.W. Lai
Publikováno v: Transportation Science, 53(4), 986-1000. INFORMS Inst.for Operations Res.and the Management Sciences
Dabia, S, Lai, D & Vigo, D 2019, ' An exact algorithm for a rich vehicle routing problem with private fleet and common carrier ', Transportation Science, vol. 53, no. 4, pp. 986-1000 . https://doi.org/10.1287/trsc.2018.0852
The vehicle routing problem with private fleet and common carrier (VRPPC) is a generalization of the classical vehicle routing problem in which the owner of a private fleet can either visit a customer with one of the owner’s vehicles or assign the
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6edce269be38b7562aa508455c07d5ea
https://research.vu.nl/en/publications/a0c2ea4b-d532-4433-861e-a35fcea3874a
Zobrazit plný text záznamu
5
An exact approach for a variant of the pollution-routing problem
Autor: Said Dabia, Emrah Demir, Tom Van Woensel
Publikováno v: Transportation Science, 51(2), 607-628. INFORMS Institute for Operations Research and the Management Sciences
Transportation Science, 51(2), 607-628. INFORMS Inst.for Operations Res.and the Management Sciences
Dabia, S, Demir, E & Woensel, T V 2017, ' An Exact Approach for a Variant of the Pollution-Routing Problem ', Transportation Science, vol. 51, no. 2, pp. 607-628 . https://doi.org/10.1287/trsc.2015.0651
The pollution-routing problem (PRP) is a recently introduced green vehicle routing problem in the field of green logistics. It concerns routing a number of vehicles to serve a set of geographically dispersed customers within their time windows, joint
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fb03c138012244a32406b8e5d7c912f
http://www.scopus.com/inward/record.url?scp=85019737487&partnerID=8YFLogxK
Zobrazit plný text záznamu
6
The time-dependent capacitated profitable tour problem with time windows and precedence constraints
Autor: Said Dabia, Peng Sun, Tom Van Woensel, Lucas P. Veelenturf
Publikováno v: European Journal of Operational Research, 264(3), 1058-1073. Elsevier
Sun, P, Veelenturf, L P, Dabia, S & Van Woensel, T 2018, ' The time-dependent capacitated profitable tour problem with time windows and precedence constraints ', European Journal of Operational Research, vol. 264, no. 3, pp. 1058-1073 . https://doi.org/10.1016/j.ejor.2017.07.004
We introduce the time-dependent capacitated profitable tour problem with time windows and precedence constraints. This problem concerns determining a tour and its departure time at the depot that maximizes the collected profit minus the total travel
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9b8954e8d3074cf0677f6cb2c680a31
https://research.vu.nl/en/publications/ebacbcf1-66f7-429e-958e-6e0848dd8585
Zobrazit plný text záznamu
7
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Autor: Ton de Kok, Said Dabia, Tom Van Woensel, Stefan Ropke
Publikováno v: Dabia, S, Ropke, S & van Woensel, T 2013, ' Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows ', Transportation Science, vol. 47, no. 3, pp. 380-396 . https://doi.org/10.1287/trsc.1120.0445
Transportation Science, 47(3), 380-396. INFORMS Institute for Operations Research and the Management Sciences
Transportation Science, 47(3), 380-396. INFORMS Inst.for Operations Res.and the Management Sciences
This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a2567c37db92fb0ebb978bb18cc2724
https://doi.org/10.1287/trsc.1120.0445
Zobrazit plný text záznamu
8
Approximating multi-objective scheduling problems
Autor: Tom Van Woensel, Ton de Kok, El-Ghazali Talbi, Said Dabia
Publikováno v: Computers and Operations Research
Computers and Operations Research, Elsevier, 2013, 40 (5), pp.1165-1175. ⟨10.1016/j.cor.2012.12.001⟩
Computers & Operations Research, 40(5), 1165-1175. Elsevier
Computers and Operations Research, 40(5), 1165-1175. Elsevier Limited
Computers and Operations Research, 2013, 40 (5), pp.1165-1175. ⟨10.1016/j.cor.2012.12.001⟩
Dabia, S, Talbi, E G & van Woensel, T 2013, ' Approximating multi-objective scheduling problems ', Computers and Operations Research, vol. 40, no. 5, pp. 1165-1175 . https://doi.org/10.1016/j.cor.2012.12.001
International audience; In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59d507f32d759760d642b4ca94686bbb
https://hal.inria.fr/hal-00830040
Zobrazit plný text záznamu
9
Exact and Approximate Schemes for Robust Optimization Problems with Decision Dependent Information Discovery
Autor: Rosario Paradiso, Angelos Georghiou, Said Dabia, Denise Tönissen
Publikováno v: Vrije Universiteit Amsterdam
Paradiso, R, Georghiou, A, Dabia, S & Tönissen, D 2022 ' Exact and Approximate Schemes for Robust Optimization Problems with Decision Dependent Information Discovery ' .
Uncertain optimization problems with decision dependent information discovery allow the decision maker to control the timing of information discovery, in contrast to the classic multistage setting where uncertain parameters are revealed sequentially
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0caf28c5445fafd62f00900c6b9ad863
https://research.vu.nl/en/publications/3a5fc839-1c6a-4f6e-8e56-16150d5c6c82
Zobrazit plný text záznamu
10
A stochastic inventory policy with limited transportation capacity
Autor: Said Dabia, Kiesmüller, G. P., Nico Dellaert
Publikováno v: Pure TUe
In this paper we consider a stochastic single-item inventory problem. A retailer keeps a single product on stock to satisfy customers stochastic demand. The retailer is replenished periodically from a supplier with ample stock. For the delivery of th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::eb244c8df7ac0dbb54356db0c5dd3a5b
https://research.tue.nl/en/publications/58b7d6f7-ed14-4bab-b2bf-3b3b46e3e6a7
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje