忘恩负义的人
发表于 2025-3-25 06:45:13
Examination of Posterior Segment,ve developed a heuristic algorithm based on a Scatter Search (SS) framework to find a lower bound for this maximization problem. The proposed algorithm was developed with two search features: a guidance search and a local search feature. For the first feature a Scatter Search algorithm was chosen wi
可憎
发表于 2025-3-25 10:59:57
Recent Results in Cancer Researchscribe their commons features and their variants and we give the list of their applications to different combinatorial optimization problems. We also show how the simulated annealing algorithm and the threshold accepting algorithm can be considered as noising methods when the components of the noisi
讽刺滑稽戏剧
发表于 2025-3-25 14:36:45
http://reply.papertrans.cn/32/3153/315241/315241_23.png
震惊
发表于 2025-3-25 18:44:00
http://reply.papertrans.cn/32/3153/315241/315241_24.png
帽子
发表于 2025-3-25 22:23:23
http://reply.papertrans.cn/32/3153/315241/315241_25.png
隐士
发表于 2025-3-26 03:06:14
A Grasp for Job Shop Scheduling,entional GRASP two new concepts: an intensification strategy and POP (Proximate Optimality Principle) in the construction phase. These two concepts were first proposed by Fleurent and Glover (1999) in the context of the quadratic assignment problem. Computational experience on a large set of standar
一再烦扰
发表于 2025-3-26 05:02:06
A Reactive Grasp for Transmission Network Expansion Planning,blems. GRASP is a metaheuristic that has been shown to be powerful in solving combinatorial problems. It is composed of two phases: the construction phase where a feasible solution is iteratively built, and a local search phase that seeks improvements within a given neighborhood of the solution foun
fiscal
发表于 2025-3-26 10:03:25
http://reply.papertrans.cn/32/3153/315241/315241_28.png
转换
发表于 2025-3-26 15:46:53
A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem,c characteristic of a combinatorial problem, but rather a property of the topology induced in a solution space by, for example, a neighborhood operator. This paper presents a study of global convexity for a multiple objective travelling salesman problem using the 2-OPT operator. The analysis is base
UTTER
发表于 2025-3-26 17:21:12
A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem,tive feature of this algorithm is that the starting solution, instead of being obtained from scratch or from some kind of well known heuristic method, as is the usual pattern, is given by a lower bound for this problem. This lower bound is a minimum cost .-tree with two . edges incident on the depot