Researchers and practitioners were invited to submit their original and unpublished work that are related to transportation safety and interoperability, including (but not limited to): • Passengers, freight and logistics • rail... more
Researchers and practitioners were invited to submit their original and unpublished work that are related to transportation safety and interoperability, including (but not limited to): • Passengers, freight and logistics • rail punctuality, capacity and accessibility • Modelling and traffic management • Transport information systems • Applications and Requirements in Traffic and Transportation (Safety and Security, Simulation…) • Safety, Methods for Risk Analysis; Risk Acceptance, Risk Measures, Signalling Applications. • Methods and Tools for Modelling, Validation / Verification and Tests
Research Interests:
This paper is aimed at presenting a transport information system that is dedicated to the co-modal transportation services. The problem is formulated with a three layers model and this work concentrates on the second layer — the... more
This paper is aimed at presenting a transport information system that is dedicated to the co-modal transportation services. The problem is formulated with a three layers model and this work concentrates on the second layer — the assignment of the vehicles on each section of the itineraries. In terms of cost, travel time and other criteria, the optimization for choosing the best route for each request is implemented with Evolutionary Algorithms (EAs) and local search algorithm for the allocation of limited transportation resource. A special encoding method is developed to adapt the concerned problem and the operators for EAs are also detailed. With the aggregation approach, the fitness function is defined for EAs. According to the size of requests and the characteristics of the problem, an appropriate algorithm will be selected. With respect to users’ preferences and availability of vehicles, the simulation is provided in this contribution to illustrate the proposed method.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Abstract The world seaborne trade has been developing considerably in the last decade, mainly due to globalization and continued development of emerging countries. This world growth has an influence on the development of ports and... more
Abstract The world seaborne trade has been developing considerably in the last decade, mainly due to globalization and continued development of emerging countries. This world growth has an influence on the development of ports and maritime terminals. It is always a hot topic about how to make the port run in the maximum productivity with minimum cost. But in order to ameliorate the productivity in a confined space ports, it's important to optimize the assignment of the existing distributed resources, such as the cranes, the storages, the vehicles routing etc.. In this paper, given a P-time Petri Net model of a small size or middle size port with repetitive and periodic operation process, we propose a method to adjust the initial setting of system's parameters to keep itself run with maximum productivity and minimum cost. Moreover the necessities for changing the parameters of the resources are studied and a simple mathematical model to evaluate the cost of change is also proposed in the end of the paper.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use... more
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain jobs. The actual demand is scheduled in priority by the genetic algorithm. Then, the predicted demand is inserted using various methods in order to generate different scheduling solutions. Two lower bounds are given for the makespan before and after the insertion of the predicted demand. The performance of solutions is evaluated by comparing the real values obtained on many static and dynamic scheduling examples with the corresponding lower bounds.
Research Interests:
Le problème d'ordonnancement des job-shops flexibles est l'un des problèmes d'optimisation NP difficile. Pour de tels problèmes, les heuristiques ou métaheuristiques deviennent lrqunique moyen drqobtenir une bonne solution.... more
Le problème d'ordonnancement des job-shops flexibles est l'un des problèmes d'optimisation NP difficile. Pour de tels problèmes, les heuristiques ou métaheuristiques deviennent lrqunique moyen drqobtenir une bonne solution. Dans notre travail, nous utilisons les algorithmes génétiques pour optimiser ce type de problèmes. La liste des jobs est divisée en deux ensembles : la liste des jobs fermes avec des caractéristiques connues, qui sera ordonnancée par un algorithme génétique, et la liste des jobs prévisionnels, qui sera insérée dans les disponibilités des machines. Ce modèle d'ordonnancement peut appara^itre dans des problématiques de demandes ou de ventes incertaines, et peut aussi s'appliquer, sous une forme modifiée, à des problématiques d'insertion de tâches de maintenance. Deux bornes inférieures sont données pour le makespan des jobs fermes et pour le makespan des jobs prévisionnels, la performance des solutions est évaluée en comparant les valeurs ré...
This paper explain why and how to implement the double loops service in the automatic subway of Lille, France. This double loops service is characterized by the presence of more possible circuit for the train. The system permits one to... more
This paper explain why and how to implement the double loops service in the automatic subway of Lille, France. This double loops service is characterized by the presence of more possible circuit for the train. The system permits one to serve some portions of the lines, which have some high density of population. We explain how to solve the different
Research Interests:
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In lots of cases, the combination of goals and resources has an exponentially increasing search space, the generation of consistently good... more
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In lots of cases, the combination of goals and resources has an exponentially increasing search space, the generation of consistently good scheduling is particularly difficult because we have a very large combinatorial search space and precedence constraints between operations. Genetic algorithms are preferred to exact methods. They
Research Interests:
This paper explains how to minimize a makespan of the job shop scheduling problem using evolutionary programs. So the job shop scheduling problem is among the hardest combinatorial problems. Not only is it NP complete but it is one of the... more
This paper explains how to minimize a makespan of the job shop scheduling problem using evolutionary programs. So the job shop scheduling problem is among the hardest combinatorial problems. Not only is it NP complete but it is one of the worst NP complete class members, but for better performance it is very important to develop an efficient representational scheme and effective genetic operators. Our objective is to improve performance of the evolutionary programs based approach to job-shop scheduling problems by creating a new representation of the chromosome where we integrate the precedence constraint, and the new genetic operators associated with this original representation
Research Interests:
Research Interests:
Research Interests:
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In lots of cases, the combination of goals and resources has exponentially increasing search space. The objective of resolution of such a problem... more
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In lots of cases, the combination of goals and resources has exponentially increasing search space. The objective of resolution of such a problem is generally, to maximize the production with a lower cost and makespan. In this paper, we explain how to modify the objective function of
Research Interests:
The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a... more
The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and solving the dynamic DRP in the application using the MOSA algorithm. Numerical results show the benefits of this algorithm in a real-time context.
Research Interests:
In recent years, the necessity of considering uncertainty in scheduling problem is recognized by many scholars and practitioners, but there are still not effective methods to deal with uncertainty. This paper focuses on the flexible job... more
In recent years, the necessity of considering uncertainty in scheduling problem is recognized by many scholars and practitioners, but there are still not effective methods to deal with uncertainty. This paper focuses on the flexible job shop scheduling problem (FJSP). Uncertainties in FJSP includes many aspects, such as the urgently arrival jobs, the uncertain working condition of the machines, etc. In this paper, we propose an inserting algorithm (IA), which can be used to treat the necessary machine maintenance for reducing unavailability of machines. We use the condition based maintenance (CBM) to reduce unavailability of machines. A problem focused in this paper is the flexible job shop scheduling problem with preventive maintenance (FJSPPM). An inserting algorithm (IA) is utilized to add PM into a preschedule scheme of FJSP which is obtained through an evolutional algorithm. Furthermore, a new better solution for an instance in benchmark of FJSP is obtained.
Research Interests:
Research Interests:
PurposeThis paper deals with real‐time control of urban traffic with an emphasis on public transportation systems. The main objective is the regulation of traffic after the occurrence of disturbances. In a few words, the problem is to... more
PurposeThis paper deals with real‐time control of urban traffic with an emphasis on public transportation systems. The main objective is the regulation of traffic after the occurrence of disturbances. In a few words, the problem is to find a feasible schedule for some vehicles of some lines subject to certain constraints in order to design a decision support system (DSS) that detects, analyses and resolves disturbances.Design/methodology/approachThis work is achieved in cooperation with a public transport company called SEMURVAL. It consists of developing a DSS for the future transportation network of Valenciennes (city in the north of France). As a consequence, regulators of traffic have to treat a new lot of information and it becomes necessary to assist them in order to keep up with demands and to come up to passengers' expectations and hopes.FindingsFrom the case study finds that the solution proposed assures that arrival times of vehicles are more regular.Originality/valueT...
Research Interests: Engineering, Transport Engineering, Operations Research, Public Transport, Traffic control, and 10 moreDecision support system, Business and Management, Case Study, Manufacturing Engineering, Real Time Control, Design Methodology, Schedule, Transportation Networks, Control Management, and transport system
Research Interests:
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In a lot of cases, the combination of goals and resource exponentially increases search space. The objective of resolution of such a problem is... more
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In a lot of cases, the combination of goals and resource exponentially increases search space. The objective of resolution of such a problem is generally, to maximize the production with a lower cost and makespan. In this paper, we explain how to modify the objective function of genetic algorithms to treat the multi-objective problem and to generate a set of diversified “optimal” solutions in order to help decision maker. We are interested in one of the problems occurring in the production workshops where the list of demands is split into firm (certain) jobs and predicted jobs. One wishes to maximize the produced quantity, while minimizing as well as possible the makespan and the production costs. Genetic algorithms are used to find the scheduling solution of the firm jobs because they are well adapted to the treatment of the multi-objective optimization problems. The predicted jobs will be inserted in the real solutions (given by genetic algorithms). The solutions proposed by our approach are compared to the lower bound of the cost and makespan in order to prove the quality and robustness of our proposed approach.