A routing and scheduling model is proposed for the one depot, multi‐vehicle, many‐to‐one, and vehicle capacity constraint problem. The model takes both the operator's and the user's objectives into account....
详细信息
A routing and scheduling model is proposed for the one depot, multi‐vehicle, many‐to‐one, and vehicle capacity constraint problem. The model takes both the operator's and the user's objectives into account. The operator's objective is assumed to be the minimization of transportation cost or distance travelled; while the user's objective is represented by the minimum time difference between the desired and the actual times of vehicle arrival. The routing model is based on the classical Clarke‐Wright algorithm; however, node pairs in the model are ranked by an index generated by the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). Thus, unlike the traditional Clarke‐Wright model, this model incorporates not only transportation cost but also the desired time of vehicle visit in the route development. Furthermore, different sets of routes can be produced depending upon the degree of preference attached to each objective. A step‐by‐step computation procedure and a set of examples are also presented.
In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) ...
详细信息
In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC.
Logistics Service Providers (LSP) are increasingly adopting Automated Parcel Lockers (APLs) to mitigate the operational pressure of last-mile logistics. The optimal location of APL stations is key for reaching custome...
详细信息
Logistics Service Providers (LSP) are increasingly adopting Automated Parcel Lockers (APLs) to mitigate the operational pressure of last-mile logistics. The optimal location of APL stations is key for reaching customers' demand while keeping the investment reasonable. Previous studies developed optimization algorithms and applied them to virtual instances of the problem, lacking applicability to real-life situations encountered by LSPs who aim to serve an urban area with such technology. This study proposes a novel solution to the APLs location problem by combining mixed-integer linear programming and greedy heuristics algorithms. The study tested the propose solution on real customers' demand data related to Turin, Italy. Results show that covering 90% of the estimated potential demand requires 10 to 11 APLs, on average. The adopted approach enables finding an optimal solution grounded in a real geographical context without requiring time-consuming optimization.
Graph coloring is a typical NP-Complete *** paper puts forward a new method of vertex coloring of a graph based on genetic algorithm and heuristics *** algorithm involves Chromosomal Representation, Fitness function,s...
详细信息
Graph coloring is a typical NP-Complete *** paper puts forward a new method of vertex coloring of a graph based on genetic algorithm and heuristics *** algorithm involves Chromosomal Representation, Fitness function,selection operator,crossover operator,etc. The algorithm has been implemented and tested on various sets of *** experiments show that this new algorithm can improve time complexity and obtain a better result.
This paper presents a framework of purchasing a single item online from multiple suppliers with a new sourcing tool called electronic reverse auctions (ERAs). Because of the ability to deal both positive and negat...
详细信息
This paper presents a framework of purchasing a single item online from multiple suppliers with a new sourcing tool called electronic reverse auctions (ERAs). Because of the ability to deal both positive and negative attributes, benefits, opportunities, costs, risks (BOCR) method is integrated with fuzzy analytic hierarchy process (FAHP) to evaluate the suppliers' performance in the framework. After prequalified evaluation of suppliers, a nonlinear integer programming (NIP) is formulated to solve the winner determination problem considering procurement cost, administrative cost, and switching cost In order to solve the NIP model, a heuristic algorithm is proposed to find feasible solutions. The FAHP-BOCR approach integrated with the mathematic programming is used to improve the efficiency of the final result. Finally, a numerical analysis is proposed to analyze the impact of the parameters.
Graph coloring is a typical NP-Complete *** paper puts forward a new method of vertex coloring of a graph based on genetic algorithm and heuristics *** algorithm involves Chromosomal Representation,Fitness function,se...
详细信息
Graph coloring is a typical NP-Complete *** paper puts forward a new method of vertex coloring of a graph based on genetic algorithm and heuristics *** algorithm involves Chromosomal Representation,Fitness function,selection operator,crossover operator,*** algorithm has been implemented and tested on various sets of *** experiments show that this new algorithm can improve time complexity and obtain a better result.
暂无评论