ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais ma... more ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais maîtrisés, les organisations ont besoin doutils d'exécution optimale de tâches tels que lordonnancement. Le succès des méthodologies de résolution des problèmes dordonnancement de production basées sur les métaheuristiques sexplique par leur capacité à fournir des solutions proches de loptimum, dans des temps raisonnables. Cet ouvrage se consacre, dans un premier temps, aux métaheuristiques appliquées aux problèmes dordonnancement multicritère, qui sont des cas particuliers des problèmes doptimisation combinatoire multicritère, généralement NP-difficiles. Puis, il sintéresse aux préoccupations dordonnancement dans le secteur du transport qui suscitent également de multiples problèmes doptimisation. Deux grands domaines dapplication se distinguent, celui des systèmes de transport et celui des ressources de transport intervenant dans un atelier.
ABSTRACT The inventory routing problem (IRP) deals with the study of the inter-relationship betwe... more ABSTRACT The inventory routing problem (IRP) deals with the study of the inter-relationship between two important activities in the supply chain: transportation of commodities and inventory management. In this paper, we study a variant of the multi-product IRP and we propose a general variable neighbourhood search metaheuristic for solving it. We present several neighbourhood structures based on the movement of quantities between routes and periods. Computational experiments show the efficiency of the proposed metaheuristic when compared with the state-of-the-art based on variable neighbourhood search.
ABSTRACT In this article, we consider a transportation problem with different kinds of locations:... more ABSTRACT In this article, we consider a transportation problem with different kinds of locations: V, T, and W. The set consists of vertices that must be visited through the use of potential locations in V and W consists of locations that must be covered. The problem consists in minimizing vehicle routes on a subset of V including T. We develop a variable neighborhood search heuristic based on a variable neighborhood descent in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. We tested and compared our algorithm on datasets based on TSP Library instances.
ABSTRACT In this paper we propose two variants of the variable neighborhood search heuristics to ... more ABSTRACT In this paper we propose two variants of the variable neighborhood search heuristics to solve the (0 – 1) Quadratic Knapsack Problem. The mixed variable neighborhood descent (Mixed-VND) and the Skewed general variable neighborhood search (SGVNS). The proposed algorithms were tested over a set of large-sized instances with 1000 and 2000 binary variables and the results were compared to those reported from the literature. Encouraging results are obtained.
ABSTRACT The vehicle routing problem with multiple trips (VRPMT) is a variants of the standard (V... more ABSTRACT The vehicle routing problem with multiple trips (VRPMT) is a variants of the standard (VRP), where each vehicle can be used more than once during the working period. For this NP-Hard problem, we propose a variable neighborhood search Algorithm in which four neighborhood structure are designed to find the planning of trips. The algorithm was tested over a set of benchmark problems and the obtained solutions were compared with five previously proposed algorithms. Encouraging results are obtained.
ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais ma... more ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais maîtrisés, les organisations ont besoin doutils d'exécution optimale de tâches tels que lordonnancement. Le succès des méthodologies de résolution des problèmes dordonnancement de production basées sur les métaheuristiques sexplique par leur capacité à fournir des solutions proches de loptimum, dans des temps raisonnables. Cet ouvrage se consacre, dans un premier temps, aux métaheuristiques appliquées aux problèmes dordonnancement multicritère, qui sont des cas particuliers des problèmes doptimisation combinatoire multicritère, généralement NP-difficiles. Puis, il sintéresse aux préoccupations dordonnancement dans le secteur du transport qui suscitent également de multiples problèmes doptimisation. Deux grands domaines dapplication se distinguent, celui des systèmes de transport et celui des ressources de transport intervenant dans un atelier.
ABSTRACT The inventory routing problem (IRP) deals with the study of the inter-relationship betwe... more ABSTRACT The inventory routing problem (IRP) deals with the study of the inter-relationship between two important activities in the supply chain: transportation of commodities and inventory management. In this paper, we study a variant of the multi-product IRP and we propose a general variable neighbourhood search metaheuristic for solving it. We present several neighbourhood structures based on the movement of quantities between routes and periods. Computational experiments show the efficiency of the proposed metaheuristic when compared with the state-of-the-art based on variable neighbourhood search.
ABSTRACT In this article, we consider a transportation problem with different kinds of locations:... more ABSTRACT In this article, we consider a transportation problem with different kinds of locations: V, T, and W. The set consists of vertices that must be visited through the use of potential locations in V and W consists of locations that must be covered. The problem consists in minimizing vehicle routes on a subset of V including T. We develop a variable neighborhood search heuristic based on a variable neighborhood descent in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. We tested and compared our algorithm on datasets based on TSP Library instances.
ABSTRACT In this paper we propose two variants of the variable neighborhood search heuristics to ... more ABSTRACT In this paper we propose two variants of the variable neighborhood search heuristics to solve the (0 – 1) Quadratic Knapsack Problem. The mixed variable neighborhood descent (Mixed-VND) and the Skewed general variable neighborhood search (SGVNS). The proposed algorithms were tested over a set of large-sized instances with 1000 and 2000 binary variables and the results were compared to those reported from the literature. Encouraging results are obtained.
ABSTRACT The vehicle routing problem with multiple trips (VRPMT) is a variants of the standard (V... more ABSTRACT The vehicle routing problem with multiple trips (VRPMT) is a variants of the standard (VRP), where each vehicle can be used more than once during the working period. For this NP-Hard problem, we propose a variable neighborhood search Algorithm in which four neighborhood structure are designed to find the planning of trips. The algorithm was tested over a set of benchmark problems and the obtained solutions were compared with five previously proposed algorithms. Encouraging results are obtained.
Uploads
Papers by Bassem Jarboui