A food delivery company operates in Balıkesir performs to the distribution for products of a certain brand from central warehouse customers located districts Altıeylül and Karesi by using two vehicles with high capacity. The visits on routes meet their daily demands is able all at end day. In this study, company's was considered as Vehicle Routing Problem, it aimed reconstruct help various algo...

Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...

For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale optimisation problems. Up to now, several frameworks have been implemented for this family of methods. Some of them are either dedicated to Local Search such as EasyLocal++[5], Localizer[8], LocalSearch framework[1], Templar[7], HotFrame[4] or to Evolutionary Computation such as EOS[2], EASEA[3]. Th...

Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have also been proposed recently, and proven to be remarkably scalable, but without the theoretical guarantees of their offline counterparts. Thus it seems natural to try to unify offline and online techniques, preserving the ...

This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and...

This paper documents our investigation into various heuristic methods to solve the vehicle routing problem with time windows (VRPTW) to near optimal solutions. The objective of the VRPTW is to serve a number of customers within prede®ned time windows at minimum cost (in terms of distance travelled), without violating the capacity and total trip time constraints for each vehicle. Combinatorial o...

Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of locat...

This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for such experimentation. The goal is to promote thoughtful, well-planned, and extensive testing of heuristics, full disclosure of experimental conditions, and integrity in and reproducibility of the reported results. Departmentof Computer Science andEngineering, SouthernMet...