this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

We study a new variant of the well-studied vehicle routing problem with time windows (VRPTW), called fragility-constrained VRPTW, which assumes that (1) capacity is organized in multiple identical stacks; (2) all items picked up at customer are either “fragile” or not; (3) no nonfragile can be put on top fragile item (the fragility constraint); and (4) en route load rearrangement possible. firs...

Most time-dependent vehicle routing problems are based on a similar modeling paradigm: travel time information is represented by functions between pairs of points interest (e.g., depot or customers). Only few papers investigate how these can be computed using the available information. Furthermore, most them neglect possibility that different paths could selected in road network depending compr...

The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. A...

In this paper we describe a method for optimistic parallel discrete event simulation for multi-agent systems. We present an adaptive metric that calculates the appropriate degree of optimism for an agent process based on the reads and writes made to the shared state by that agent. We conclude by showing how results from our investigations into the application of moving time windows in agent sim...