@article {Annouch2021607, title = {An Adaptive Genetic Algorithm for a New Variant of the Gas Cylinders Open Split Delivery and Pickup with Two-dimensional Loading Constraints}, journal = {International Journal of Advanced Computer Science and Applications}, volume = {12}, number = {1}, year = {2021}, note = {cited By 1}, pages = {607-619}, abstract = {This paper studies a combination of two well-known problems in distribution logistics, which are the truck loading problem and the vehicle routing problem. In our context, a customer daily demand exceeds the truck capacity. As a result, the demand has to be split into several routes. In addition, it is required to assign customers to depots, which means that each customer is visited just once by any truck in the fleet. Moreover, we take into consideration a customer time windows. The studied problem can be defined as a Multi-depots open split delivery and pickup vehicle routing problem with two-dimensional loading constraints and time windows (2L-MD-OSPDTW). A mathematical formulation of the problem is proposed as a mixed-integer linear programming model. Then, a set of four class instances is used in a way that reflects the real-life case study. Furthermore, a genetic algorithm is proposed to solve a large scale dataset. Finally, preliminary results are reported and show that the MILP performs very well for small test instances while the genetic algorithm can be efficiently used to solve the problem for a widereaching test instances. {\textcopyright} 2021. All rights reserved.}, keywords = {Adaptive genetic algorithms, Constraint programming, Fleet operations, Genetic algorithms, Integer programming, Large dataset, Loading constraints, Multi depots, Pickups, Routing algorithms, Sales, Split delivery, Split pickups, Test instances, Time windows, Trucks, Two-dimensional, Two-dimensional loading, Vehicle routing, Vehicle Routing Problems}, doi = {10.14569/IJACSA.2021.0120170}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100379461\&doi=10.14569\%2fIJACSA.2021.0120170\&partnerID=40\&md5=7e2a6546b01de8c70b8cca5545b09a4e}, author = {Annouch, A. and Bellabdaoui, A.} } @conference {Annouch2017193, title = {Variable neighborhood search heuristic for the full truckload problem in liquefied petroleum gas supply}, booktitle = {2017 International Colloquium on Logistics and Supply Chain Management: Competitiveness and Innovation in Automobile and Aeronautics Industries, LOGISTIQUA 2017}, year = {2017}, note = {cited By 0}, pages = {193-198}, abstract = {In this paper, we propose a generalized version of the full truckload vehicle routing problem FTVRP in the liquefied petroleum gas (LPG) supply chain. We focus on the supply component that is considered to be the main element of LPG supply chain. The objective consists of determining a schedule of weekly supply which minimizes as well the gas acquisition cost as that of its transport. In order to effectively solve this problem, the mathematical model is established and a neighboring search solution heuristics (VNS) is proposed. The initial solution is generated using a Greedy Algorithm by selecting the most beneficial nodes in terms of transportation cost and gas acquisition cost. In the experiment, different sizes{\textquoteright} problems are used and the numerical results getting with big instance are explored. {\textcopyright} 2017 IEEE.}, doi = {10.1109/LOGISTIQUA.2017.7962897}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655256\&doi=10.1109\%2fLOGISTIQUA.2017.7962897\&partnerID=40\&md5=2b385b6056aad92e333bd54bb956201d}, author = {Annouch, A. and Bellabdaoui, A.} } @conference {Annouch2016, title = {A literature review on the full trackload vehicle routing problems}, booktitle = {Proceedings of the 3rd IEEE International Conference on Logistics Operations Management, GOL 2016}, year = {2016}, note = {cited By 0}, abstract = {This article presents a literature review of the full truckload vehicle routing problem (FTVRP). In this problem, each vehicle can serve only one order at a time; thereafter, the delivery must be completed before the next request. Our review has considered some papers published between 1983 and 2015 and their classification was based on two main areas: First, the issue discussed with encountered business constraints and the obvious applications in industry. Second, the solution methods, both exact and approached (heuristics and metaheuristics). Some lines for further works are presented as well. {\textcopyright} 2016 IEEE.}, doi = {10.1109/GOL.2016.7731723}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85002412779\&doi=10.1109\%2fGOL.2016.7731723\&partnerID=40\&md5=9ebb4126ca35885c1a32d508e792ef9d}, author = {Annouch, A. and Bouyahyaoui, K. and Bellabdaoui, A.} } @conference {Annouch2016, title = {Split delivery and pickup vehicle routing problem with two-dimensional loading constraints}, booktitle = {SITA 2016 - 11th International Conference on Intelligent Systems: Theories and Applications}, year = {2016}, note = {cited By 0}, abstract = {In this paper, we address the distribution problem of liquefied petroleum gas (LPG). In particular we are targeting the optimization of pickup and split delivery of gas bottles to a set of customers with loading constraints. The problem combines the loading of a heterogeneous fleet of vehicles through a set of different size racks and then the establishment of divisible deliveries (split delivery: SDVRP). The problem discussed in this paper can be presented as a Multi-depot Two-Loading Split Delivery and Pickup using Heterogeneous fleet of Vehicles with Time Windows vehicle Routing Problem and with Multi-Product (2L-SDP-HVRPTW-MP). After proposing a mathematical formulation for this problem (MILP), we tested our model firstly by a small instances using ILOG CPLEX solver following this by testing and discussing numerical results. {\textcopyright} 2016 IEEE.}, doi = {10.1109/SITA.2016.7772277}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010366293\&doi=10.1109\%2fSITA.2016.7772277\&partnerID=40\&md5=dcf8e30d18c805be9f705a1c130183cf}, author = {Annouch, A. and Bellabdaoui, A. and Minkhar, J.} } @conference {Annouch2015, title = {Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers}, booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015}, year = {2015}, note = {cited By 0}, abstract = {In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results. {\textcopyright} 2015 IEEE.}, doi = {10.1109/SITA.2015.7358387}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962464691\&doi=10.1109\%2fSITA.2015.7358387\&partnerID=40\&md5=cc982aff48cd7feee13855a979efa66d}, author = {Annouch, A. and Bellabdaoui, A.} }