نتایج جستجو برای: vehicle routing with hard time windows
تعداد نتایج: 9835279 فیلتر نتایج به سال:
Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows
Garbage is one of the environmental problems. The process transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This has limitation capacity an uncertainty waste volume travel time. RCOCVRP solved by heur...
An electric vehicle routing problem (EVRP) with time windows is carried out using a hybrid algorithm. Through the modeling of problem, not only energy consumptions and charging durations EDVs, but also conventional flow formulations soft window constraints are taken into account. A solution method proposed to solve EVRP. The combines genetic algorithm simulated annealing complement each other. ...
In this paper we deal with a generalization of the Vehicle Routing Problem with Time Windows that considers time-dependent travel times and costs. Through several steps we transform this extension into an Asymmetric Capacitated Vehicle Routing Problem, so it can be solved both optimally and heuristically with known codes.
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید