×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Novel Tour Construction Heuristic for Pick-Up and Delivery Routing Problems

Click here to flash read.

arXiv:2405.03774v1 Announce Type: new
Abstract: In logistic applications that require the pickup and delivery of items, route optimization problems can be modeled as precedence constrained traveling salesperson problems. The combinatorial nature of this problem restricts the application of exact algorithms to small instances, and heuristics are largely preferred for tractability. However, due to precedence constraints that restrict the order in which locations can be visited, heuristics outside of the nearest neighbor algorithm have been neglected in literature. While the convex hull cheapest insertion heuristic is known to produce good solutions in the absence of precedence constraints, i.e., when locations can be visited in any order, it has not been adapted for pick-up and delivery considerations. This paper presents an adapted convex hull cheapest insertion heuristic that accounts for precedence constraints and compares its solutions with the nearest neighbor heuristic using the TSPLIB benchmark data set. The proposed algorithm is particularly suited to cases where pickups are located in the periphery and deliveries are centrally located, outperforming the Nearest Neighbor algorithm in every examined instance.

Click here to read this post out
ID: 842704; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: May 8, 2024, 7:31 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 8
CC:
No creative common's license
Comments: