Abstract With the rapid development of tourism in economy, popular demand for also increases. Unreasonable distribution arises a series problems such as reduction tourist satisfaction and decrease income attractions. Based on consideration route planning, mathematical model which takes maximization overall all groups objective function is established by taking age preferences tourists, upper li...

Vehicle mobility optimization in urban areas is a long-standing problem smart city and spatial data analysis. Given the complex scenario unpredictable social events, our work focuses on developing mobile sequential recommendation system to maximize profitability of vehicle service providers (e.g., taxi drivers). In particular, we treat dynamic route as long-term decision-making task. A reinforc...

The paper presents an innovative method for tourist route planning inside a destination. necessity of reorganizing the routes within destination comes as immediate response to Covid-19 crisis. implementation destinations can bring important advantage in transforming into safer one times and post-Covid-19. existing trend shortening stay length has been accelerated while epidemic became pandemic....

In this paper, the map of a network air routes was updated by removing non-optimal and replacing them with best ones. An integer linear programming model developed. The aim to find optimal in superspace based on performance-based navigation. were found from DIJKSTRA algorithm that calculates shortest path graph. Simulations python language real traffic areas showed improvements brought surface ...

This paper presents an optimization algorithm which simultaneously deals with the problems of placement and global routing in an analog macrocell layout style. The optimization process is based on a simulated annealing algorithm. We evaluate the physical placement of the cells and estimate the global routing for each intermediate solution generated. The basic idea, that together with an appropr...

Search in a complex design space (e.g. in VLSI design) is only feasible when it is factored into smaller ones. A common and useful factoring is the hierarchy of abstraction. Such problems are then attacked by linking together stochastic search programs. At each point in the design process it is necessary to choose whether to continue looking for a better design at the current level, or working ...

FPGA is a 2D array of configurable logic blocks. Packing is to pack logic elements into device specific configurable logic blocks for subsequent placement. The traditional fixed delay model of inter and intra cluster delays used in packing does not represent post-placement delays and often leads to sub-optimal solutions. This paper presents a new layout driven packing algorithm, named LDPack, b...

The Rural Postman Problem (RPP) is a classic “edge-routing” problem. A mathematical programming formulation of RPP that differs fundamentally from those in the literature was introduced, but not tested computationally, by GarÞnkel and Webb (1999). A rudimentary algorithm that yields lower bounds via cutting planes and upper bounds via heuristics is developed and tested for a variation of that f...