The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

differential steering of in-wheel electric vehicle provides the functions of both active steering and power assisted steering with the coupling control of force and displacement transfer characteristic of system. a collaborative optimization model of the differential power-assisted steering system of in-wheel electric vehicle is built, with steering economy as the main system optimization goal,...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one ano...

many appealing multicast services such as on-demand tv, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. when multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. designing a good multicast tree to route data packets could enhance the...