This study concerns the deployment of large numbers of container transporting vehicles on a network consisting of (dedicated) roads and logistic sites such as container terminals. Each site is managed autonomously by a site manager. The fleet of vehicles is deployed by a fleet manager. On request of the site managers, the fleet manager allocates vehicles to be hired by the site managers. Next, ...

The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths and the assignment of buses on these routes. The objective of this problem is to minimize the number of vehicles required and to maximize the number of demands transported. This paper considers a Memetic Algorithm fo...

As an emerging variant of the vehicle loading problem, the heterogeneous multi-type fleet vehicle loading problem in finished vehicle logistics (HVLP-FVL) is modeled and solved. The HVLPFVL maximizes the total profit of a vehicle fleet where different models of finished vehicles result in different profits and routing costs are considered based on distance travelled. Addressing the vehicle stru...

To date, the research on agriculture vehicles in general and Agriculture Mobile Robots (AMRs) particular has focused a single vehicle (robot) its agriculture-specific capabilities. Very little work explored coordination of fleets such daily execution farming tasks. This is especially case when considering overall fleet performance, efficiency scalability context highly automated that perform ta...

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. Taking a basic GA to solve the CVRP, we propose a new problem dependent recombi...

the conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. in this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. the idea is to assign a penalty cost to al...

time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. the stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. it is well-known that the stabi...

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles and the sequencing of stops for each vehicle to minimize transportation costs. This paper presents two different genetic algorithm models (panmitic and cellular models) for providing solutions for the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the ...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...